Coordinated weighted sampling for estimating aggregates over multiple weight assignments
نویسندگان
چکیده
منابع مشابه
Coordinated Weighted Sampling for Estimating Aggregates Over Multiple Weight Assignments
Many data sources are naturally modeled by multiple weight assignments over a set of keys: snapshots of an evolving database at multiple points in time, measurements collected over multiple time periods, requests for resources served at multiple locations, and records with multiple numeric attributes. Over such vectorweighted data we are interested in aggregates with respect to one set of weigh...
متن کاملEstimating Sum by Weighted Sampling
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarantees on the estimated sum. In this paper we consider various sampling methods besides uniform sampling, in particular sampling a variable with probability proportional to its value, referred to as linear weighted sampli...
متن کاملOn Estimating Path Aggregates over Streaming Graphs
We consider the updatable streaming graph model, where edges of a graph arrive or depart in arbitrary sequence and are processed in an online fashion using sub-linear space and time. We study the problem of estimating aggregate path metrics Pk defined as the number of pairs of vertices that have a simple path between them of length k. For a streaming undirected graph with n vertices, m edges an...
متن کاملWeighted scale-free networks with stochastic weight assignments.
We propose a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows, the weights of links are driven either by the connectivity with probability p or by the fitness with probability 1-p. Numerical results show that the total weight exhibits a power-law distri...
متن کاملWeighted Random Sampling over Data Streams
In this work, we present a comprehensive treatment of weighted random sampling (WRS) over data streams. More precisely, we examine two natural interpretations of the item weights, describe an existing algorithm for each case ([2,4]), discuss sampling with and without replacement and show adaptations of the algorithms for several WRS problems and evolving data streams.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2009
ISSN: 2150-8097
DOI: 10.14778/1687627.1687701